Extension of Embeddings in the Computably Enumerable Degrees
نویسندگان
چکیده
Gödel’s Incompleteness Theorem [Göd31] and his subsequent work on computable functions [Göd34] exhibited undecidability in the most familiar mathematical settings, even in elementary number theory. Following Gödel, there has been an intensive study of noncomputable sets arising in ordinary mathematics. The computably enumerable (c.e.) sets (those which can be listed by a computable method) are of particular interest because they appear naturally in most branches of mathematics and there is a noncomputable c.e. set. Thus, they play a key role in well-known results such as Gödel’s incompleteness theorem, the unsolvability of the word problem for finitely presented groups, and the unsolvability of Hilbert’s tenth problem on Diophantine equations. Turing [Tur39] introduced the notion of a set of natural numbers A being computable relative to set B, written A ≤T B. The equivalence class of A under ≡T is the (Turing) degree of A. Friedberg [Fri57] and independently Mučnik [Muc56] solved Post’s problem by producing a noncomputable incomplete c.e. set, and in doing so introduced the finite injury priority method. Let 0 denote the degree of the computable sets and 0′ denote the degree of K, the complete c.e. set, and let R = (R, <,0,0′). Lower case boldface letters a,b, c, . . .x,y, z denote c.e. degrees. The Friedberg-Mučnik theorem may be regarded as the first and easiest extension of embeddings result for R. It asserts that (∃x)[0 < x < 0′].
منابع مشابه
Extensions of Embeddings below Computably Enumerable Degrees
Toward establishing the decidability of the two quantifier theory of the ∆ 2 Turing degrees with join, we study extensions of embeddings of upper-semi-lattices into the initial segments of Turing degrees determined by computably enumerable sets, in particular the degree of the halting set 0. We obtain a good deal of sufficient and necessary conditions.
متن کاملEmbeddings into the Computably Enumerable Degrees
We discuss the status of the problem of characterizing the finite (weak) lattices which can be embedded into the computably enumerable degrees. In particular, we summarize the current status of knowledge about the problem, provide an overview of how to prove these results, discuss directions which have been pursued to try to solve the problem, and present some related
متن کاملAlgebraic aspects of the computably enumerable degrees.
A set A of nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. The class of sets B which contain the same information as A under Turing computability (</=T) is the (Turing) degree of A, and a degree is c.e. if it contains a c.e. set. The extension of embedding problem for the c.e. degrees R = (R, ...
متن کاملThe Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
The existence of isolated degrees was proved by Cooper and Yi in 1995 in [6], where a d.c.e. degree d is isolated by a c.e. degree a if a < d is the greatest c.e. degree below d. A computably enumerable degree c is non-isolating if no d.c.e. degree above c is isolated by c. Obviously, 0 is a non-isolating degree. Cooper and Yi asked in [6] whether there is a nonzero non-isolating degree. Arslan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004